Evolutionary stochastic search for Bayesian model exploration
نویسندگان
چکیده
منابع مشابه
Bayesian Stochastic Search for VAR Model Restrictions
We propose a Bayesian stochastic search approach to selecting restrictions for Vector Autoregressive (VAR) models. For this purpose, we develop a Markov Chain Monte Carlo (MCMC) algorithm that visits high posterior probability restrictions on the elements of both the VAR regression coefficients and the error variance matrix. Numerical simulations show that stochastic search based on this algori...
متن کاملESS++: a C++ objected-oriented algorithm for Bayesian stochastic search model exploration
SUMMARY ESS++ is a C++ implementation of a fully Bayesian variable selection approach for single and multiple response linear regression. ESS++ works well both when the number of observations is larger than the number of predictors and in the 'large p, small n' case. In the current version, ESS++ can handle several hundred observations, thousands of predictors and a few responses simultaneously...
متن کاملBayesian stochastic model specification search for seasonal and calendar effects
We apply a recent methodology, Bayesian stochastic model specification search (SMSS), for the selection of the unobserved components (level, slope, seasonal cycles, trading days effects) that are stochastically evolving over time. SMSS hinges on two basic ingredients: the non-centered representation of the unobserved components and the reparameterization of the hyperparameters representing stan...
متن کاملEvolutionary Exploration of Search Spaces
Exploration and exploitation are the two cornerstones of problem solving by search. Evolutionary Algorithms (EAs) are search algorithms that explore the search space by the genetic search operators , while exploitation is done by selection. During the history of EAs diierent operators have emerged, mimicing asexual and sexual reproduction in Nature. Here we give an overview of the variety of th...
متن کاملStochastic Local Search for Bayesian Networks
The paper evaluates empirically the suitability of Stochastic Local Search algorithms (SLS) for nding most probable explanations in Bayesian networks. SLS algorithms (e.g., GSAT, WSAT [16]) have recently proven to be highly e ective in solving complex constraint-satisfaction and satis ability problems which cannot be solved by traditional search schemes. Our experiments investigate the applicab...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bayesian Analysis
سال: 2010
ISSN: 1936-0975
DOI: 10.1214/10-ba523